منابع مشابه
Optimized Projection for Sparse Representation Based Classification
Dimensionality reduction (DR) methods have been commonly used as a principled way to understand the high-dimensional data such as facial images. In this paper, we propose a new supervised DR method called Optimized Projection for Sparse Representation based Classification (OP-SRC), which is based on the recent face recognition method, Sparse Representation based Classification (SRC). SRC seeks ...
متن کاملOptimized Projection Matrix for Compressive Sensing
Compressive sensing (CS) is mainly concerned with low-coherence pairs, since the number of samples needed to recover the signal is proportional to the mutual coherence between projection matrix and sparsifying matrix. Until now, papers on CS always assume the projection matrix to be a random matrix. In this paper, aiming at minimizing the mutual coherence, a method is proposed to optimize the p...
متن کاملDiscriminative Projection Selection Based Face Image Hashing
Face image hashing is an emerging method used in biometric verification systems. In this paper, we propose a novel face image hashing method based on a new technique called discriminative projection selection. We apply the Fisher criterion for selecting the rows of a random projection matrix in a user-dependent fashion. Moreover, another contribution of this paper is to employ a bimodal Gaussia...
متن کاملSequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing methods either use random projections or extract principal directions from the data to derive hash functions. The resulting embedding suffers from poor discrimination when compact codes are used. In this paper, we propose a...
متن کاملHashing with dual complementary projection learning for fast image retrieval
Due to explosive growth of visual content on the web, there is an emerging need of fast similarity search to efficiently exploit such enormous web contents from very large databases. Recently, hashing has become very popular for efficient nearest neighbor search in large scale applications. However, many traditional hashing methods learn the binary codes in a single shot or only employ a single...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2019
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2018.04.027